An Adaptive Version of Brandes' Algorithm for Betweenness Centrality
نویسندگان
چکیده
منابع مشابه
Towards Improving Brandes' Algorithm for Betweenness Centrality
Betweenness centrality, measuring how many shortest paths pass through a vertex, is one of the most important network analysis concepts for assessing the (relative) importance of a vertex. The famous state-of-art algorithm of Brandes [2001] computes the betweenness centrality of all vertices in O(mn) worst-case time on an n-vertex and m-edge graph. In practical follow-up work, significant empir...
متن کاملA Faster Algorithm for Betweenness Centrality
The betweenness centrality index is essential in the analysis of social networks, but costly to compute. Currently, the fastest known algorithms require Θ(n) time and Θ(n) space, where n is the number of actors in the network. Motivated by the fast-growing need to compute centrality indices on large, yet very sparse, networks, new algorithms for betweenness are introduced in this paper. They re...
متن کاملFurther Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملFast algorithm for successive computation of group betweenness centrality.
In this paper, we propose a method for rapid computation of group betweenness centrality whose running time (after preprocessing) does not depend on network size. The calculation of group betweenness centrality is computationally demanding and, therefore, it is not suitable for applications that compute the centrality of many groups in order to identify new properties. Our method is based on th...
متن کاملA Divide-and-Conquer Algorithm for Betweenness Centrality
Given a graph G we define the betweenness centrality of a node v in V as the fraction of shortest paths between all node pairs in V that contain v. For this setting we describe Brandes++, a divide-and-conquer algorithm that can efficiently compute the exact values of betweenness scores. Brandes++ uses Brandes– the most widelyused algorithm for betweenness computation – as its subroutine. It ach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2020
ISSN: 1526-1719
DOI: 10.7155/jgaa.00543